A doubly divisible nearly Kirkman system

نویسنده

  • Paul Smith
چکیده

in this note we exhibit an exam;rle of a new class c)f combinatorial array, A ROOK square i9j it: an r x t square each of whose I ells is either empty or contains a distinct uncrrdered pair with cniik I,,;_ += 4er of integers (! 3, . . ., I + 1) such that each integer appears exactly Once m each row and exactly once in eacii bL:!:~WC oresent an analagaus square whose entries arc unordered triples, ncme of whose two-element subsets is repeated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kirkman Triple Systems of Orders 27 , 33 , and 39

In the search for doubly resolvable Kirkman triple systems of order v, systems admitting an automorphism of order (v 3)=3 fixing three elements, and acting on the remaining elements in three orbits of length (v 3)=3, have been of particular interest. We have established by computer that 100 such Kirkman triple systems exist for v = 21, 81,558 for v = 27, at least 4,494,390 for v = 33, and at le...

متن کامل

Kirkman triple systems of order 21 with nontrivial automorphism group

There are 50,024 Kirkman triple systems of order 21 admitting an automorphism of order 2. There are 13,280 Kirkman triple systems of order 21 admitting an automorphism of order 3. Together with the 192 known systems and some simple exchange operations, this leads to a collection of 63,745 nonisomorphic Kirkman triple systems of order 21. This includes all KTS(21)s having a nontrivial automorphi...

متن کامل

The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs

A Kirkman square with index λ, latinicity μ, block size k, and v points, KSk(v; μ, λ), is a t × t array (t = λ(v − 1)/μ(k − 1)) defined on a v-set V such that (1) every point of V is contained in precisely μ cells of each row and column, (2) each cell of the array is either empty or contains a k-subset of V , and (3) the collection of blocks obtained from the non-empty cells of the array is a (...

متن کامل

Semi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...

متن کامل

On generalized Howell designs with block size three

In this paper, we examine a class of doubly resolvable combinatorial objects. Let t, k, λ, s and v be nonnegative integers, and let X be a set of v symbols. A generalized Howell design, denoted t-GHDk(s, v;λ), is an s × s array, each cell of which is either empty or contains a k-set of symbols from X, called a block, such that: (i) each symbol appears exactly once in each row and in each column...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1977